A new lower bound on graph gonality
نویسندگان
چکیده
We define a new graph invariant called the scramble number. show that number of is lower bound for gonality and an upper treewidth. Unlike treewidth, not minor monotone, but it subgraph monotone under subdivision. compute several families graphs which these invariants are strictly greater than
منابع مشابه
A linear lower bound on the gonality of modular curves
0.2. Remarks. The proof, which was included in the author’s thesis [א], follows closely a suggestion of N. Elkies. In the exposition here many details were added to the argument in [א]. We utilize the work [L-Y] of P. Li and S. T. Yau on conformal volumes, as well as the known bound on the leading nontrivial eigenvalue of the non-euclidean Laplacian λ1 ≥ 21 100 [L-R-S]. If Selberg’s eigenvalue ...
متن کاملA lower bound on the independence number of a graph
For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.
متن کاملA Formalised Lower Bound on Undirected Graph Reachability
We revisit the proof of Cook & Rackoff that Jumping Automata on Graphs (JAGs) cannot decide reachability in undirected graphs. Cook & Rackoff prove this result by constructing, for any given JAG, a graph, which cannot be traversed exhaustively by the JAG. In this paper we show how this result can be abstracted and modularised, so that it can be formalised in the theorem prover Coq. We demonstra...
متن کاملA New Lower Bound on the Independence Number of a Graph and Applications
The independence number of a graph G, denoted α(G), is the maximum cardinality of an independent set of vertices in G. The independence number is one of the most fundamental and well-studied graph parameters. In this paper, we strengthen a result of Fajtlowicz [Combinatorica 4 (1984), 35–38] on the independence of a graph given its maximum degree and maximum clique size. As a consequence of our...
متن کاملA Lower Bound on the Diameter of the Flip Graph
The flip graph is the graph whose nodes correspond to non-isomorphic combinatorial triangulations and whose edges connect pairs of triangulations that can be obtained one from the other by flipping a single edge. In this note we show that the diameter of the flip graph is at least
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2022
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.11.003